PML – a new proof assistant
نویسندگان
چکیده
We will present our ongoing work on a new proof assistant and deduction system named PML. The basic idea is to start from an MLlike programming language and add specification and proof facilities. On the programming language side, the language unifies certain concepts: PML uses only one notion of sum types (polymorphic variants) and one notion of products (extensible records). These can then be used to encode modules and objects. PML’s typing algorithm is based on a new constraint consistency check (as opposed to constraint
منابع مشابه
A new proof for the Banach-Zarecki theorem: A light on integrability and continuity
To demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the Banach-Zareckitheorem is presented on the basis of the Radon-Nikodym theoremwhich emphasizes on measure-type properties of the Lebesgueintegral. The Banach-Zarecki theorem says that a real-valuedfunction $F$ is absolutely continuous on a finite closed intervalif and only if it is continuo...
متن کاملAccurate Summation: Towards a Simpler and Formal Proof
This paper provides a simpler proof of the “accurate summation” algorithm proposed by Demmel and Hida in [1]. It also gives improved bounds in some cases, and examples showing that those new bounds are optimal. This simpler proof will be used to obtain a computer-generated proof of Demmel-Hida’s algorithm, using a proof assistant like HOL, PVS or Coq.
متن کاملDeveloping Certified Program Verifiers with a Proof Assistant
I describe ongoing work on a new approach to foundational proof-carrying code. The key new idea is to use certified program verifiers to embody customized program verification strategies, specialized to particular safety policies, enforcement mechanisms, and source-level compilers. A certified verifier is an executable program that has a full correctness proof. The particular strategy that I’ve...
متن کاملHipster: Integrating Theory Exploration in a Proof Assistant
This paper describes Hipster, a system integrating theory exploration with the proof assistant Isabelle/HOL. Theory exploration is a technique for automatically discovering new interesting lemmas in a given theory development. Hipster can be used in two main modes. The first is exploratory mode, used for automatically generating basic lemmas about a given set of datatypes and functions in a new...
متن کاملPresenting TSTP Proofs with Inference Web Tools
This paper describes the translation of proofs in the Thousands of Solutions from Theorem Provers (TSTP) solution library to the Proof Markup Language (PML), and the subsequent use of Inference Web (IW) tools to provide new presentations of the proofs. The translation enriches the TSTP proofs with proof provenance meta-data, and provides new possibilities for proof processing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007